LTL Model Checking with use of Generalised Stuttering and Characteristic Patterns

Linear Temporal Logic (LTL) Model Checking can be used to check whether a concurrent system satisfies constraints such as fairness or liveliness among others. The main bottleneck is the space taken by the structure used to represent the system. When the LTL formula does not contain the ‘next’ operator, partial order reduction can be used to reduce the space requirement. We tried in this internship to use LTL fragments to be able to reduce the space requirement when the formula does contain ‘next’, or to reduce even more the space requirement when the formula does not contain ‘next’ and contains a bounded number of ‘until’.